After the Turing Machine
نویسنده
چکیده
Problems in implementing DNA and other types of molecular computers stem from the inherent physical nature of molecules and their reactions. The current theory of computation makes assumptions that at best are very crude approximations of the physical chemistry. A theory which took into account the physical chemistry would likely be very diierent from what we have now and should help in designing more optimal molecular computing systems. In this paper I describe brieey the discordance between these assumptions and the physical chemistry; indicate some of the properties a more physically realistic model might have; and sketch some of the possibilities for a computing system which exploited the physical chemistry. We are developing a model for networks of biochemical reactions and molecules incorporating treatments of both continuous and discrete aspects of biochemical systems. The formal system of the model provides an example of what a CPC might be if the problems of encoding and design were solved. Moreover the model may be useful in resolving design issues once it is suuciently populated with data.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملBayesian perspective over time
Thomas Bayes, the founder of Bayesian vision, entered the University of Edinburgh in 1719 to study logic and theology. Returning in 1722, he worked with his father in a small church. He also was a mathematician and in 1740 he made a novel discovery which he never published, but his friend Richard Price found it in his notes after his death in 1761, reedited it and published it. But until L...
متن کاملKolmogorov Complexity: Sources, Theory and Applications
The theory of Kolmogorov complexity is based on the discovery, by Alan Turing in 1936, of the universal Turing machine. After proposing the Turing machine as an explanation of the notion of a computing machine, Turing found that there exists one Turing machine which can simulate any other Turing machine. Complexity, according to Kolmogorov, can be measured by the length of the shortest program ...
متن کاملComputation Beyond the Turing Limit
Even Alan Turing himself thought about a machine that could break the barrier that had been set by the Church-Turing Thesis resting upon his concept of an universal Turing machine. His Omachine enhances a conventional Turing machine by adding an oracle in a black box. In addition to the normal operations of a Turing machine, this machine can ask the oracle questions (depending on the current st...
متن کاملUniversal Turing Machine
Recent advances in amphibious theory and flexible archetypes are based entirely on the assumption that e-business and write-back caches are not in conflict with XML. after years of extensive research into web browsers, we demonstrate the evaluation of Internet QoS. We disprove that fiber-optic cables and lambda calculus are rarely incompatible.
متن کاملAn Intensional Concurrent Faithful Encoding of Turing Machines
The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary computation. However, these encodings are usually by simulating the entire Turing Machine within the language, or by encoding a language that d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999